Two - Level , Many - Paths

نویسندگان

  • Kevin Knight
  • Marina del Rey
  • Vasileios Hatzivassiloglou
چکیده

Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be robust against incomplete or inaccurate inputs. To attack these problems, we have built a hybrid generator , in which gaps in symbolic knowledge are lled by statistical methods. We describe algorithms and show experimental results. We also discuss how the hybrid generation model can be used to simplify current generators and enhance their portability, even when perfect knowledge is in principle obtainable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A search-set model of path tracing in graphs

We present a predictive model of human behaviour when tracing paths through a node-link graph, a low-level abstract task that feeds into many other visual data analysis tasks that require understanding topological structure. We introduce the idea of a search set, namely the paths that users are most likely to search, as a useful intermediate level for analysis that lies between the global level...

متن کامل

A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths

Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...

متن کامل

Counting peaks and valleys in k-colored Motzkin paths

This paper deals with the enumeration of k-colored Motzkin paths with a fixed number of (left and right) peaks and valleys. Further enumeration results are obtained when peaks and valleys are counted at low and high level. Many well-known results for Dyck paths are obtained as special cases.

متن کامل

Policy-Preferred Paths in AS-level Internet Topology Graphs

Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, a...

متن کامل

Evaluation of underwater acoustic propagation model (Ray theory) in a river using Fluvial Acoustic Tomography System

Underwater acoustics is widely used in many applications, such as oceanography, marine biology, hydrography, fishery, etc. Different models are introduced to simulate the underwater acoustic propagation in the oceans and the seas. In this study, the Ray Theory model is used to simulate the acoustic wave propagation in a shallow-freshwater river (Gono River) located in western part of Japan. The...

متن کامل

Many-to-many disjoint paths in hypercubes with faulty vertices

This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995